翻訳と辞書
Words near each other
・ Waverly Plantation (Cunningham, North Carolina)
・ Waverly Plantation (Leon County, Florida)
・ Waverly Public Library
・ Waverly Sandstone
・ Waverly School
・ Waverly School District
・ Waverly School District 145
・ Waverly Senior High School
・ Wavelet for multidimensional signals analysis
・ Wavelet modulation
・ Wavelet noise
・ Wavelet packet decomposition
・ Wavelet scalar quantization
・ Wavelet transform
・ Wavelet transform modulus maxima method
Wavelet Tree
・ Wavell Heights, Queensland
・ Wavell Hinds
・ Wavell Starr
・ Wavell State High School
・ Wavell Wakefield, 1st Baron Wakefield of Kendal
・ Wavellite
・ WaveMaker
・ Wavemakers
・ WaveMethod
・ Waven William
・ Wavendon
・ Wavendon Heath Ponds
・ Waveney
・ Waveney (disambiguation)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Wavelet Tree : ウィキペディア英語版
Wavelet Tree

The Wavelet Tree is a succinct data structure to store strings in compressed space. It generalizes the \mathbf_q and \mathbf_q operations defined on bitvectors to arbitrary alphabets.
Originally introduced to represent compressed suffix arrays,〔 it has found application in several contexts.〔〔 The tree is defined by recursively partitioning the alphabet into pairs of subsets; the leaves correspond to individual symbols of the alphabet, and at each node a bitvector stores whether a symbol of the string belongs to one subset or the other.
The name derives from an analogy with the wavelet transform for signals, which recursively decomposes a signal into low-frequency and high-frequency components.
== Properties ==
Let \Sigma be a finite alphabet with \sigma=|\Sigma|. By using succinct dictionaries in the nodes, a string s \in \Sigma^
* can be stored in nH_0(s) + o(|s|\log \sigma), where H_0(s) is the order-0 empirical entropy of s.
If the tree is balanced, the operations \mathbf, \mathbf_q, and \mathbf_q can be supported in O(\log \sigma) time.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Wavelet Tree」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.